Triangulations with Circular and Parabolic Arcs
نویسنده
چکیده
In this paper, we expand circular arc triangulations with parabolic arcs, which are triangulations whose edges are circular or parabolic arcs. Creating triangulations this way bears several advantages if angles are to be optimized, especially for finite element method. A typical reason for the occurrence of small angles in a straight line triangulation is that the geometry of the vertex set forces slim triangles in the vicinity of the domain boundary. Such angles can be enlarged, by optimizing the arc curvatures for the given triangulation. With arc triangulation we can improve straight line triangulation such that the result of finite element method with the same account of bivariate functions is better. We compare parabolic and circular arc triangulations. We represent circular arc triangles as rational Bézier triangles and parabolic arc triangles as polynomial Bézier triangles. Clearly, the computing of finite elements with rational Bézier triangles is computationally more demanding than with parabolic arc triangles represented with polynomial Bézier triangles. Maximizing the smallest angle in a combinatorially fixed arc triangulation of a point set can be formulated as a linear program for circular arc and as a nonlinear program for parabolic arcs. This guarantees a fast solution of the optimization problem. We believe that arc triangulations constitute a useful tool especially in finite element methods.
منابع مشابه
Triangulations with Circular Arcs
An important objective in the choice of a triangulation is that the smallest angle becomes as large as possible. In the straight line case, it is known that the Delaunay triangulation is optimal in this respect. We propose and study the concept of a circular arc triangulation— a simple and effective alternative that offers flexibility for additionally enlarging small angles—and discuss its appl...
متن کاملPointed drawings of planar graphs☆
We study the problem how to draw a planar graph crossing-free such that every vertex is incident to an angle greater than π. In general a plane straight-line drawing cannot guarantee this property. We present algorithms which construct such drawings with either tangent-continuous biarcs or quadratic Bézier curves (parabolic arcs), even if the positions of the vertices are predefined by a given ...
متن کاملDrawing trees and triangulations with few geometric primitives
We define the visual complexity of a plane graph drawing to be the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g. you need only one line segment to draw two collinear edges of the same vertex). We show that trees can be drawn with 3n/4 straight-line segments on a polynomial grid, and with n/2 straight-line segments on ...
متن کاملA calculus for ideal triangulations of three-manifolds with embedded arcs
Refining the notion of an ideal triangulation of a compact three-manifold, we provide in this paper a combinatorial presentation of the set of pairs (M,α), where M is a three-manifold and α is a collection of properly embedded arcs. We also show that certain well-understood combinatorial moves are sufficient to relate to each other any two refined triangulations representing the same (M,α). Our...
متن کاملThe Pattern of Ground Deformations due to Circular Tunneling
This paper presents the results of a recent study about the following aspects relevant to tunneling in soft grounds:e) The domain of deformations due to tunneling in soft ground can be specified within a boundary of a parabolic shape. This boundary is defined by a parabolic formula as a function of a central angle which depends on the soil type i.e., either cohesive or cohesionless. This para...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013